On the reconstruction index of permutation groups: general bounds
نویسندگان
چکیده
منابع مشابه
Some new bounds on the general sum--connectivity index
Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...
متن کاملPERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملSome Bounds on General Sum Connectivity Index
function f: G , with this property that f(G1) = f(G2) if G1 and G2 are isomorphic. There are several vertex distance-based and degree-based indices which introduced to analyze the chemical properties of molecule graph. For instance: Wiener index, PI index, Szeged index, geometric-arithmetic index, atom-bond connectivity index and general sum connectivity index are introduced to test the perf...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملpermutation groups with bounded movement attaining the bounds for odd primes
let g be a transitive permutation group on a set ? and let m be a positive integer. if no element of g moves any subset of ? by more than m points, then |? | [2mp i (p-1)] wherep is the least odd primedividing |g |. when the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, i i n. furthermore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aequationes mathematicae
سال: 2005
ISSN: 0001-9054,1420-8903
DOI: 10.1007/s00010-005-2799-1